Efficient Processing of Spatiotemporal Joins1
نویسندگان
چکیده
Among other operations, a spatiotemporal DBMS should efficiently answer the spatiotemporal join. This paper presents an evaluation of spatiotemporal join algorithms using these new structures, particularly a partially persistent R-Tree called Temporal R-Tree and the 2+3D R-Tree. Starting from spatial join algorithms, we present algorithms for processing spatiotemporal joins over time instants and intervals on both spatiotemporal data structures. Finally, we implement and test these new algorithms with a couple of generated spatiotemporal data sets. Our experiments show that our algorithms ́ performance is good even in extreme cases, showing its good scalability – especially for the TRTree.
منابع مشابه
Indexing the Spatiotemporal . . .
In Geographic InfolTnation Systems spatial objects may change their spatiallocation and/or shapes over time. Query processing of such spatiotemporal objects consists of spatial query conditions and temporal query conditions. Dur study focuses on representing the spatiotemporal monitoring of a polygonal object and aims at developing an efficient data structure supporting queries and operations t...
متن کاملA Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval
The paper is concerned with the time efficient processing of spatiotemporal predicates, i.e. spatial predicates associated with an exact temporal constraint. A set of such predicates forms a buffer query or a Spatio-temporal Pattern (STP) Query with time. In the more general case of an STP query, the temporal dimension is introduced via the relative order of the spatial predicates (STP queries ...
متن کاملTechnical Report: Parallel Distance Threshold Query Processing for Spatiotemporal Trajectory Databases on the GPU
Processing moving object trajectories arises in many application domains and has been addressed by practitioners in the spatiotemporal database and Geographical Information System communities. In this work, we focus on a trajectory similarity search, the distance threshold query, which finds all trajectories within a given distance d of a search trajectory over a time interval. We demonstrate t...
متن کاملSTEPQ: Spatio-Temporal Engine for Complex Pattern Queries
With the increasing complexity and wide diversity of spatiotemporal applications, the query processing requirements over spatiotemporal data go beyond the traditional query types, e.g., range, kNN, and aggregation queries along with their variants. Most applications require support for evaluating powerful spatio-temporal pattern queries (STPQs) that form higher-order correlations and compositio...
متن کاملSpatiotemporal Kriging with External Drift
In statistics it is often assumed that sample observations are independent. But sometimes in practice, observations are somehow dependent on each other. Spatiotemporal data are dependent data which their correlation is due to their spatiotemporal locations.Spatiotemporal models arise whenever data are collected across bothtime and space. Therefore such models have to be analyzed in termsof thei...
متن کامل